Covering Radius of Two-dimensional Lattices
نویسندگان
چکیده
The covering radius problem in any dimension is not known to be solvable in nondeterministic polynomial time, but when in dimension two, we give a deterministic polynomial time algorithm by computing a reduced basis using Gauss’ algorithm in this paper.
منابع مشابه
On the Covering Multiplicity of Lattices
Let the lattice Λ have covering radius R, so that closed balls of radius R around the lattice points justcover the space. The covering multiplicity CM(Λ) is the maximal number of times the interiors of theseballs overlap. We show that the least possible covering multiplicity for an n-dimensional lattice is n ifn ≤ 8, and conjecture that it exceeds n in all other cases. We determine ...
متن کاملA multiobjective continuous covering location model
This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...
متن کاملNotes on some Distance-Based Invariants for 2-Dimensional Square and Comb Lattices
We present explicit formulae for the eccentric connectivity index and Wiener index of 2-dimensional square and comb lattices with open ends. The formulae for these indices of 2-dimensional square lattices with ends closed at themselves are also derived. The index for closed ends case divided by the same index for open ends case in the limit N →&infin defines a novel quantity we call compression...
متن کاملDynamic Hub Covering Problem with Flexible Covering Radius
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
متن کاملCounterexamples to a Conjecture of Woods
A conjecture of Woods from 1972 is disproved. A lattice in R is called well-rounded if its shortest nonzero vectors span R, is called unimodular if its covolume is equal to one, and the covering radius of a lattice Λ is the least r such that R = Λ + Br, where Br is the closed Euclidean ball of radius r. Let Nd denote the greatest value of the covering radius over all well-rounded unimodular lat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2009 شماره
صفحات -
تاریخ انتشار 2009